<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>nih: sampling/permutations.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">nih
   &#160;<span id="projectnumber">0.5</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('permutations_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">sampling/permutations.h</div>  </div>
</div>
<div class="contents">
<a href="permutations_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2010-2011, NVIDIA Corporation</span>
<a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions are met:</span>
<a name="l00007"></a>00007 <span class="comment"> *   * Redistributions of source code must retain the above copyright</span>
<a name="l00008"></a>00008 <span class="comment"> *     notice, this list of conditions and the following disclaimer.</span>
<a name="l00009"></a>00009 <span class="comment"> *   * Redistributions in binary form must reproduce the above copyright</span>
<a name="l00010"></a>00010 <span class="comment"> *     notice, this list of conditions and the following disclaimer in the</span>
<a name="l00011"></a>00011 <span class="comment"> *     documentation and/or other materials provided with the distribution.</span>
<a name="l00012"></a>00012 <span class="comment"> *   * Neither the name of NVIDIA Corporation nor the</span>
<a name="l00013"></a>00013 <span class="comment"> *     names of its contributors may be used to endorse or promote products</span>
<a name="l00014"></a>00014 <span class="comment"> *     derived from this software without specific prior written permission.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot; AND</span>
<a name="l00017"></a>00017 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED</span>
<a name="l00018"></a>00018 <span class="comment"> * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE</span>
<a name="l00019"></a>00019 <span class="comment"> * DISCLAIMED. IN NO EVENT SHALL &lt;COPYRIGHT HOLDER&gt; BE LIABLE FOR ANY</span>
<a name="l00020"></a>00020 <span class="comment"> * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES</span>
<a name="l00021"></a>00021 <span class="comment"> * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;</span>
<a name="l00022"></a>00022 <span class="comment"> * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND</span>
<a name="l00023"></a>00023 <span class="comment"> * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span>
<a name="l00024"></a>00024 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span>
<a name="l00025"></a>00025 <span class="comment"> * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00026"></a>00026 <span class="comment"> */</span>
<a name="l00027"></a>00027 
<a name="l00033"></a>00033 <span class="preprocessor">#pragma once</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span>
<a name="l00035"></a>00035 <span class="preprocessor">#include &lt;nih/basic/types.h&gt;</span>
<a name="l00036"></a>00036 <span class="preprocessor">#include &lt;nih/basic/primes.h&gt;</span>
<a name="l00037"></a>00037 <span class="preprocessor">#include &lt;nih/basic/numbers.h&gt;</span>
<a name="l00038"></a>00038 <span class="preprocessor">#include &lt;<a class="code" href="random_8h.html" title="Defines a random number generator class.">nih/sampling/random.h</a>&gt;</span>
<a name="l00039"></a>00039 
<a name="l00040"></a>00040 <span class="keyword">namespace </span>nih {
<a name="l00041"></a>00041 
<a name="l00050"></a>00050 
<a name="l00051"></a>00051 
<a name="l00052"></a>00052 
<a name="l00053"></a>00053 
<a name="l00054"></a>00054 
<a name="l00055"></a>00055 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Sequence&gt;
<a name="l00056"></a><a class="code" href="group__permutations.html#gafa69bcf9de5f02f4e1b33f60c6f33db9">00056</a> <span class="keywordtype">void</span> <a class="code" href="group__permutations.html#gafa69bcf9de5f02f4e1b33f60c6f33db9">permute</a>(<a class="code" href="classnih_1_1_random.html">Random</a>&amp; random, <span class="keyword">const</span> uint32 n, Sequence seq)
<a name="l00057"></a>00057 {
<a name="l00058"></a>00058         <span class="keywordflow">for</span> (uint32 i = 0; i &lt; n-1; i++)
<a name="l00059"></a>00059         {
<a name="l00060"></a>00060                 <span class="keyword">const</span> <span class="keywordtype">float</span> r = random.<a class="code" href="classnih_1_1_random.html#a5ae3693b17aa9d42645fc669181843f5" title="return a random [0,1) number">next</a>();
<a name="l00061"></a>00061                 <span class="keyword">const</span> uint32 j = <a class="code" href="group__vectors.html#ga5809911d15c32de18955c59865379695">std::min</a>( uint32(<span class="keywordtype">float</span>(r) * (n - i)) + i, n-1u );
<a name="l00062"></a>00062 
<a name="l00063"></a>00063                 std::swap( seq[i], seq[j] );
<a name="l00064"></a>00064         }
<a name="l00065"></a>00065 }
<a name="l00066"></a>00066 
<a name="l00070"></a><a class="code" href="structnih_1_1_l_c_permutation__set.html">00070</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1_l_c_permutation__set.html">LCPermutation_set</a>
<a name="l00071"></a>00071 {
<a name="l00076"></a><a class="code" href="structnih_1_1_l_c_permutation__set.html#a27bf54daea4b2ec9fef4dee8b040be09">00076</a>     <a class="code" href="structnih_1_1_l_c_permutation__set.html#a27bf54daea4b2ec9fef4dee8b040be09">LCPermutation_set</a>(<span class="keyword">const</span> uint32 m, <span class="keyword">const</span> uint32 n) :
<a name="l00077"></a>00077         m_M(m), m_A(n), m_C(n)
<a name="l00078"></a>00078     {
<a name="l00079"></a>00079         <a class="code" href="classnih_1_1_random.html">Random</a> random;
<a name="l00080"></a>00080 
<a name="l00081"></a>00081         <span class="comment">// we want to pick n prime numbers at random in the range [m/2,m]</span>
<a name="l00082"></a>00082         <span class="keywordflow">for</span> (uint32 i = 0; i &lt; n; ++i)
<a name="l00083"></a>00083         {
<a name="l00084"></a>00084             <span class="keyword">const</span> <span class="keywordtype">float</span> r1 = (float(i) + random.<a class="code" href="classnih_1_1_random.html#a5ae3693b17aa9d42645fc669181843f5" title="return a random [0,1) number">next</a>())/<span class="keywordtype">float</span>(n);
<a name="l00085"></a>00085             m_A[i] = s_primes[ m/2 + quantize( r1, m/2-1 ) ];
<a name="l00086"></a>00086 
<a name="l00087"></a>00087             <span class="keyword">const</span> <span class="keywordtype">float</span> r2 = (float(i) + random.<a class="code" href="classnih_1_1_random.html#a5ae3693b17aa9d42645fc669181843f5" title="return a random [0,1) number">next</a>())/<span class="keywordtype">float</span>(n);
<a name="l00088"></a>00088             m_C[i] = s_primes[ m/2 + quantize( r2, m/2-1 ) ];
<a name="l00089"></a>00089         }
<a name="l00090"></a>00090 
<a name="l00091"></a>00091         <span class="comment">// let&#39;s permute A and C independently</span>
<a name="l00092"></a>00092         <a class="code" href="group__permutations.html#gafa69bcf9de5f02f4e1b33f60c6f33db9">permute</a>( random, n, m_A );
<a name="l00093"></a>00093         <a class="code" href="group__permutations.html#gafa69bcf9de5f02f4e1b33f60c6f33db9">permute</a>( random, n, m_C );
<a name="l00094"></a>00094     }
<a name="l00095"></a>00095 
<a name="l00100"></a><a class="code" href="structnih_1_1_l_c_permutation__set.html#aa9b83972db397ad57e2d0ee55b5e7322">00100</a>     FORCE_INLINE uint32 <a class="code" href="structnih_1_1_l_c_permutation__set.html#aa9b83972db397ad57e2d0ee55b5e7322">operator() </a>(
<a name="l00101"></a>00101         <span class="keyword">const</span> uint32 permutation_index,
<a name="l00102"></a>00102         <span class="keyword">const</span> uint32 element_index)<span class="keyword"> const</span>
<a name="l00103"></a>00103 <span class="keyword">    </span>{
<a name="l00104"></a>00104         <span class="keywordflow">return</span> m_A[ permutation_index ] * element_index + m_C[ permutation_index ] &amp; (m_M-1);
<a name="l00105"></a>00105     }
<a name="l00106"></a>00106 
<a name="l00107"></a>00107     uint32                   m_M;
<a name="l00108"></a>00108     std::vector&lt;nih::uint32&gt; m_A;
<a name="l00109"></a>00109     std::vector&lt;nih::uint32&gt; m_C;
<a name="l00110"></a>00110 };
<a name="l00111"></a>00111 
<a name="l00115"></a><a class="code" href="structnih_1_1_permutation__set.html">00115</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1_permutation__set.html">Permutation_set</a>
<a name="l00116"></a>00116 {
<a name="l00121"></a><a class="code" href="structnih_1_1_permutation__set.html#a5d2718fb64fab202b29c4f454fb25381">00121</a>     <a class="code" href="structnih_1_1_permutation__set.html#a5d2718fb64fab202b29c4f454fb25381">Permutation_set</a>(<span class="keyword">const</span> uint32 m, <span class="keyword">const</span> uint32 n) :
<a name="l00122"></a>00122         m_M(m), m_tables(m*n)
<a name="l00123"></a>00123     {
<a name="l00124"></a>00124         <a class="code" href="classnih_1_1_random.html">Random</a> random;
<a name="l00125"></a>00125 
<a name="l00126"></a>00126         <span class="comment">// loop through the set of n permutations</span>
<a name="l00127"></a>00127         <span class="keywordflow">for</span> (uint32 i = 0; i &lt; n; ++i)
<a name="l00128"></a>00128         {
<a name="l00129"></a>00129             <span class="comment">// build the i-th table</span>
<a name="l00130"></a>00130             <span class="keywordflow">for</span> (nih::uint32 j = 0; j &lt; m; ++j)
<a name="l00131"></a>00131                 m_tables[ i*m + j ] = j;
<a name="l00132"></a>00132 
<a name="l00133"></a>00133             <a class="code" href="group__permutations.html#gafa69bcf9de5f02f4e1b33f60c6f33db9">permute</a>( random, m, &amp;m_tables[i*m] );
<a name="l00134"></a>00134         }
<a name="l00135"></a>00135     }
<a name="l00136"></a>00136 
<a name="l00141"></a><a class="code" href="structnih_1_1_permutation__set.html#aa74d7e78932141a5562fca993fc55f51">00141</a>     FORCE_INLINE uint32 <a class="code" href="structnih_1_1_permutation__set.html#aa74d7e78932141a5562fca993fc55f51">operator() </a>(
<a name="l00142"></a>00142         <span class="keyword">const</span> uint32 permutation_index,
<a name="l00143"></a>00143         <span class="keyword">const</span> uint32 element_index)<span class="keyword"> const</span>
<a name="l00144"></a>00144 <span class="keyword">    </span>{
<a name="l00145"></a>00145         <span class="keywordflow">return</span> m_tables[ permutation_index * m_M + element_index ];
<a name="l00146"></a>00146     }
<a name="l00147"></a>00147 
<a name="l00148"></a>00148     uint32                   m_M;
<a name="l00149"></a>00149     std::vector&lt;nih::uint32&gt; m_tables;
<a name="l00150"></a>00150 };
<a name="l00151"></a>00151 
<a name="l00156"></a>00156 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Permutation_sequence, <span class="keyword">typename</span> Sample_sequence&gt;
<a name="l00157"></a><a class="code" href="structnih_1_1_permuted__sequence.html">00157</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1_permuted__sequence.html">Permuted_sequence</a>
<a name="l00158"></a>00158 {
<a name="l00159"></a>00159     <span class="keyword">typedef</span> <span class="keyword">typename</span> Sample_sequence::Sampler_type Sampler_type;
<a name="l00160"></a>00160 
<a name="l00165"></a><a class="code" href="structnih_1_1_permuted__sequence.html#a2bad998da0ba30bd5558bb7c39b48d1e">00165</a>     <a class="code" href="structnih_1_1_permuted__sequence.html#a2bad998da0ba30bd5558bb7c39b48d1e">Permuted_sequence</a>(
<a name="l00166"></a>00166         Sample_sequence&amp; sequence,
<a name="l00167"></a>00167         Permutation_sequence&amp; permutation_sequence) :
<a name="l00168"></a>00168         m_sequence( sequence ), m_permutation( permutation ) {}
<a name="l00169"></a>00169 
<a name="l00174"></a><a class="code" href="structnih_1_1_permuted__sequence.html#adbd66e835486f8cb3908d660e12689c5">00174</a>     Sampler_type <a class="code" href="structnih_1_1_permuted__sequence.html#adbd66e835486f8cb3908d660e12689c5">instance</a>(<span class="keyword">const</span> uint32 index, <span class="keyword">const</span> uint32 copy)
<a name="l00175"></a>00175     {
<a name="l00176"></a>00176         <span class="keywordflow">return</span> m_sequence.instance( m_permutation(copy,index), 0 );
<a name="l00177"></a>00177     }
<a name="l00178"></a>00178 
<a name="l00179"></a>00179     Permutation_sequence&amp; m_permutation;
<a name="l00180"></a>00180     Sample_sequence&amp;      m_sequence;
<a name="l00181"></a>00181 };
<a name="l00182"></a>00182 
<a name="l00186"></a>00186 } <span class="comment">// namespace nih</span>
</pre></div></div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="permutations_8h.html">permutations.h</a>      </li>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>


    <li class="footer">Generated on Thu Dec 15 2011 11:56:20 for nih by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.5.1 </li>
   </ul>
 </div>


</body>
</html>
